Self-Stabilizing Ring Orientation Using Constant Space

Self-Stabilizing Symmetry Breaking in Constant Space

(extended abstract) Alain Mayer Yoram Ofeky Rafail Ostrovskyz Moti Yungx Abstract We investigate the problem of self-stabilizing round-robin token management scheme on an anonymous bidirectional ring of identical processors, where each processor is an asynchronous probabilistic (coinipping) nite state machine which sends and receives messages. We show that the solution to this problem is equiva...

Uniform Deterministic Self-Stabilizing Ring-Orientation on Odd-Length Rings

The ring-orientation problem requires all processors on an anonymous ring to reach agreement on a direction along the ring. A self-stabilizing ring-orientation protocol eventually ensures that all processors on the ring agree on a direction, regardless of the initial states of the processors on which the protocol is started. In this paper we present two uniform deterministic self-stabilizing ri...

Deterministic, Constant Space, Self-Stabilizing Leader Election on Uniform Rings

We consider the problem of electing a leader on a ring of nameless processors by de terministic and self stabilizing protocols A processor can read the state of its neighbors and its own state to determine if it is enabled A central demon scheduler picks an enabled processor to make an atomic move In an atomic move the processor changes to a new state which is a function of its old state and th...

Deterministic , Constant Space , Self - Stabilizing Leader Electionon Uniform

We consider the problem of electing a leader on a ring of nameless processors by de-terministic and self-stabilizing protocols. A processor can read the state of its neighbors (and its own state) to determine if it is enabled. A central demon (scheduler) picks an enabled processor to make an atomic move. In an atomic move, the processor changes to a new state which is a function of its old stat...

Self - Stabilizing Network Orientation Algorithms